#define _CRT_SECURE_NO_WARNINGS 1
class Solution {
public:
    int minimumDeleteSum(string s1, string s2) {
        int m = s1.size(), n = s2.size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1));

        int sum1 = 0;
        for (auto e : s1)
            sum1 += e;
        for (auto x : s2)
            sum1 += x;
        s1 = ' ' + s1, s2 = ' ' + s2;
        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= n; j++) {

                if (s1[i] == s2[j])
                    dp[i][j] = dp[i - 1][j - 1] + s1[i];
                else
                    dp[i][j] = max(dp[i][j - 1], dp[i - 1][j]);
            }

        return sum1 - 2 * dp[m][n];
    }
};